Graphs with two trivial critical ideals

Stabilizers of Trivial Ideals

In papers by Semmes [6], Macpherson and Neumann [4] and Brazil, Covington, Penttila, Praeger and Woods [2], it has been shown that stabilizers of filters (equivalently, stabilizers of ideals) play a crucial role in the study of maximal subgroups of infinite symmetric groups. Semmes proved that if if is a maximal subgroup of S = Sym (Q), where Q is a set of infinite cardinality K and H contains ...

Strongly regular graphs with non-trivial automorphisms

!-graphs with Trivial Overlap Are Context-free

String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs give us the means of expressing and proving properties about whole families of these graphs simultaneously. While !-graphs provide elegant proofs of surprisin...

Trivial, Critical and Near-critical Scaling Limits of Two-dimensional Percolation

It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of the plane are surrounded by arbitrarily large loops and every deterministic point is almost surely surrounded by a countably infinite family of nested loops ...

Polynomial Ideals and Directed Graphs

In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph D in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic reasoning on cycles and directed cycles of graphs.